منابع مشابه
Bourgain’s Discretization Theorem
Bourgain’s discretization theorem asserts that there exists a universal constant C ∈ (0,∞) with the following property. Let X,Y be Banach spaces with dimX = n. Fix D ∈ (1,∞) and set δ = e−nCn . Assume that N is a δ-net in the unit ball of X and that N admits a bi-Lipschitz embedding into Y with distortion at most D. Then the entire space X admits a bi-Lipschitz embedding into Y with distortion ...
متن کاملA General Equivalence Theorem in the Theory of Discretization Methods
The Lax-Richtmyer theorem is extended to work in the framework of Stetter's theory of discretizations. The new result applies to both initial and boundary value problems discretized by finite elements, finite differences, etc. Several examples are given, together with a comparison with other available equivalence theorems. The proof relies on a generalized Banach-Steinhaus theorem.
متن کاملLecturer : Peter Bartlett Scribe : Ma ’ ayan Bresler 1 Review : Covering Numbers and Discretization Theorem
1 n ∑ v2 i . The covering number N is the smallest covering set such that ln(N) gives the number of bits needed to specify the function to within α. If it were log2(N) instead, we could think of it as a game of 20 questions, where the approximation to the function improves with the number of questions. In playing 20-questions, the most natural strategy is to start with broad questions and incre...
متن کاملDiscretization and Anti-discretization of Rearrangement-invariant Norms
Abstract We develop a new method of discretization and anti-discretization of weighted inequalities which we apply to norms in classical Lorentz spaces and to spaces endowed with the so-called Hilbert norm. Main applications of our results include new integral conditions characterizing embeddings Γp(v) ↪→ Γq(w) and Γp(v) ↪→ Λq(w) and an integral characterization of the associate space to Γp(v),...
متن کاملDiscretization of Rational Data
Frequently one wants to extend the use of a classification method that in principle requires records with True/False values, so that records with rational numbers can be processed. In such cases, the rational numbers must first be replaced by True/False values before the method may be applied. In other cases, a classification method in principle can process records with rational numbers directl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales de la faculté des sciences de Toulouse Mathématiques
سال: 2012
ISSN: 0240-2963
DOI: 10.5802/afst.1352